Heterogeneous spectrum sensing: challenges and methodologies

Distributed sensing is commonly used to obtain accurate spectral information over a large area. More and more heterogeneous devices are being incorporated in distributed sensing with the aim of obtaining more flexible sensing performance at lower cost. Although the concept of combining the strengths of various sensing devices is promising, the question of how to compare and combine the heterogeneous sensing results in a meaningful way is still open. To this end, this paper proposes a set of methodologies that are derived from several spectrum sensing experiments using heterogeneous sensing solutions. Each of the solutions offers different radio frequency front-end flexibility, sensing speed and accuracy and varies in the way the samples are processed and stored. The proposed methodologies cover four fundamental aspects in heterogeneous sensing: (i) storing experiment descriptions and heterogeneous results in a common data format; (ii) coping with different measurement resolutions ( in time or frequency domain); (iii) calibrating devices under strictly controlled conditions and (iv) processing techniques to efficiently analyse the obtained results. We believe that this paper provides an important first step towards a standardized and systematic approach of heterogeneous sensing solutions

Building accurate radio environment maps from multi-fidelity spectrum sensing data

In cognitive wireless networks, active monitoring of the wireless environment is often performed through advanced spectrum sensing and network sniffing. This leads to a set of spatially distributed measurements which are collected from different sensing devices. Nowadays, several interpolation methods (e.g., Kriging) are available and can be used to combine these measurements into a single globally accurate radio environment map that covers a certain geographical area. However, the calibration of multi-fidelity measurements from heterogeneous sensing devices, and the integration into a map is a challenging problem. In this paper, the auto-regressive co-Kriging model is proposed as a novel solution. The algorithm is applied to model measurements which are collected in a heterogeneous wireless testbed environment, and the effectiveness of the new methodology is validated

Deterministic scheduling for energy efficient and reliable communication in heterogeneous sensing environments in industrial wireless sensor networks

The present-day industries incorporate many applications, and complex processes, hence, a large number of sensors with dissimilar process deadlines and sensor update frequencies will be in place. This paper presents a scheduling algorithm, which takes into account the varying deadlines of the sensors connected to the cluster-head, and formulates a static schedule for Time Division Multiple Access (TDMA) based communication. The scheme uses IEEE802.15.4e superframe as a baseline and proposes a new superframe structure. For evaluation purposes the update frequencies of different industrial processes are considered. The scheduling algorithm is evaluated under varying network loads by increasing the number of nodes affiliated to a cluster-head. The static schedule generated by the scheduling algorithm offers reduced energy consumption, improved reliability, efficient network load management and improved information to control bits ratio

Unified clustering and communication protocol for wireless sensor networks

In this paper we present an energy-efficient cross layer protocol for providing application specific reservations in wireless senor networks called the “Unified Clustering and Communication Protocol ” (UCCP). Our modular cross layered framework satisfies three wireless sensor network requirements, namely, the QoS requirement of heterogeneous applications, energy aware clustering and data forwarding by relay sensor nodes. Our unified design approach is motivated by providing an integrated and viable solution for self organization and end-to-end communication is wireless sensor networks. Dynamic QoS based reservation guarantees are provided using a reservation-based TDMA approach. Our novel energy-efficient clustering approach employs a multi-objective optimization technique based on OR (operations research) practices. We adopt a simple hierarchy in which relay nodes forward data messages from cluster head to the sink, thus eliminating the overheads needed to maintain a routing protocol. Simulation results demonstrate that UCCP provides an energy-efficient and scalable solution to meet the application specific QoS demands in resource constrained sensor nodes. Index Terms — wireless sensor networks, unified communication, optimization, clustering and quality of service

Distributed Bayesian Filtering using Logarithmic Opinion Pool for Dynamic Sensor Networks

The discrete-time Distributed Bayesian Filtering (DBF) algorithm is presented for the problem of tracking a target dynamic model using a time-varying network of heterogeneous sensing agents. In the DBF algorithm, the sensing agents combine their normalized likelihood functions in a distributed manner using the logarithmic opinion pool and the dynamic average consensus algorithm. We show that each agent's estimated likelihood function globally exponentially converges to an error ball centered on the joint likelihood function of the centralized multi-sensor Bayesian filtering algorithm. We rigorously characterize the convergence, stability, and robustness properties of the DBF algorithm. Moreover, we provide an explicit bound on the time step size of the DBF algorithm that depends on the time-scale of the target dynamics, the desired convergence error bound, and the modeling and communication error bounds. Furthermore, the DBF algorithm for linear-Gaussian models is cast into a modified form of the Kalman information filter. The performance and robust properties of the DBF algorithm are validated using numerical simulations

Anticipating Daily Intention using On-Wrist Motion Triggered Sensing

Anticipating human intention by observing one's actions has many applications. For instance, picking up a cellphone, then a charger (actions) implies that one wants to charge the cellphone (intention). By anticipating the intention, an intelligent system can guide the user to the closest power outlet. We propose an on-wrist motion triggered sensing system for anticipating daily intentions, where the on-wrist sensors help us to persistently observe one's actions. The core of the system is a novel Recurrent Neural Network (RNN) and Policy Network (PN), where the RNN encodes visual and motion observation to anticipate intention, and the PN parsimoniously triggers the process of visual observation to reduce computation requirement. We jointly trained the whole network using policy gradient and cross-entropy loss. To evaluate, we collect the first daily "intention" dataset consisting of 2379 videos with 34 intentions and 164 unique action sequences. Our method achieves 92.68%, 90.85%, 97.56% accuracy on three users while processing only 29% of the visual observation on average